Parallei graph algorithms that are efficient on average
نویسندگان
چکیده
منابع مشابه
Space-efficient Basic Graph Algorithms
We reconsider basic algorithmic graph problems in a setting where an n-vertex input graph is read-only and the computation must take place in a working memory of O(n) bits or little more than that. For computing connected components and performing breadth-first search, we match the running times of standard algorithms that have no memory restrictions, for depth-first search and related problems...
متن کاملAverage Case Analysis of Dynamic Graph Algorithms 25
[32] V. V. Vazirani. A theory of alternating paths and blossoms for proving correctness of the O(p V E) general graph maximum matching algorithm. [13] G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. Linear time algorithms for nding a sparse k-connected spanning subgraph of a k-connected graph. Re-randomization and average case analys...
متن کاملEfficient algorithms for supergraph query processing on graph databases
We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs. A supergraph query q on D is to retrieve all the graphs in D such that q is a supergraph of them. The large number of graphs in databases and the NP-completeness of subgraph isomorphism testing make it challenging to efficiently processing supergraph queries. In this paper, a n...
متن کاملEfficient Parallel Graph Algorithms in Python
Domain experts in a variety of fields utilize large-scale graph analysis; however, creating high-performance parallel graph applications currently involves expertise in both graph theory and parallel programming which might not be available to the domain specialist. This project explores methods for bringing efficient parallel performance to graph applications written in Python using selective ...
متن کاملEfficient Graph Coloring with Parallel Genetic Algorithms
In this paper a new parallel genetic algorithm for coloring graph vertices is presented. In the algorithm we apply a migration model of parallelism and define two new recombination operators SPPX and CEX. For comparison two problemoriented crossover operators UISX and GPX are selected. The performance of the algorithm is verified by computer experiments on a set of standard graph coloring insta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1989
ISSN: 0890-5401
DOI: 10.1016/0890-5401(89)90035-7